Clique irreducibility and clique vertex irreducibility of graphs
نویسندگان
چکیده
منابع مشابه
Clique Irreducibility and Clique Vertex Irreducibility of Graphs
A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...
متن کاملClique irreducibility of some iterative classes of graphs
In this paper, two notions, the clique irreducibility and clique vertex irreducibility are discussed. A graph G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and it is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G. It is proved that L(G) is clique irreducible if a...
متن کاملMinimal graphs with prescribed vertex independence and clique numbers
The vertex independence number of a graph G is the maximal number of independent vertices in G. The clique number of G is the size of the largest complete subgraph of G. Let !1(v,n,r) denote the class of simple graphs on v vertices having vertex independence number n and clique number r. Let [(v,n,r) == min {dG): G E !1(v,n,r)}, where dG} denotes the number of edges in G, In this paper we study...
متن کاملOn hereditary clique-Helly self-clique graphs
A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-empty intersection, and it is hereditary clique-Helly (abbreviated HCH) if its induced subgraphs are clique-Helly. The clique graph of a graph G is the intersection graph of its cliques, and G is self-clique if it is connected and isomorphic to its clique graph. We show that every HCH graph is an induced su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2009
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm0901137l